An Association Rule Mining for Materialized View Selection and View Maintanance
نویسندگان
چکیده
منابع مشابه
An Association Rule Mining for Materialized View Selection and View Maintanance
Data warehouse (DW) is a repository with query interface in support of Decision support systems. DW required answering many complex queries, managerial level queries and analytical queries, needing to develop advanced computing techniques. The DW system process involving data modeling, ETL process, query interface and reporting system. Materialized views (MV) are the pre calculated views which ...
متن کاملAn Association Rule Mining for Materialized View Selection and View Maintenance
Data warehouse (DW) is a repository with query interface in support of Decision support systems. DW required answering many complex queries, managerial level queries and analytical queries, needing to develop advanced computing techniques. The DW system process involving data modeling, ETL process, query interface and reporting system. Materialized views (MV) are the pre calculated views which ...
متن کاملAn Improved Algorithm for Materialized View Selection
The data warehouse is subject oriented, integrated, nonvolatile and time-varying data sets, which is used to support management decision-making. A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing Decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materializ...
متن کاملMaterialized View Selection: A Survey
This is a draft of my contribution to a book chapter (doi: 10.4018/978-1-60566-816-1.ch005). We mainly categorize and review the existing approaches to materialized view selection. View selection addresses the problem of choosing materialized views in the design process of data warehouses. Informally, it can be stated as, given an estimated query workload and possibly also sets of candidate vie...
متن کاملMaterialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hierarchies. However, the problem of what to precompute is difficult and intriguing. The leading existing algorithm, BPUS, has a running time that is polynomial in the number of views and is guaranteed to be within (0.63...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/19184-0670